best first search

Terms from Artificial Intelligence: humans at the heart of algorithms

Page numbers are for draft copy at present; they will be replaced with correct numbers when final book is formatted. Chapter numbers are correct and will not change now.

Best-first search is a form of tree search where there is a heuristic evaluation for each node. At each step, the best-first algorithm chooses the node with the best heuristic to follow down the tree, only backtracking when it gets to a leaf node, or in some other way reaches em impasse.

Used in Chap. 4: pages 54, 56, 60

Also known as best first, best first